Efficient Maximal Clique Enumeration Over Graph Data
نویسندگان
چکیده
منابع مشابه
Viral Quasispecies Assembly via Maximal Clique Enumeration
Virus populations can display high genetic diversity within individual hosts. The intra-host collection of viral haplotypes, called viral quasispecies, is an important determinant of virulence, pathogenesis, and treatment outcome. We present HaploClique, a computational approach to reconstruct the structure of a viral quasispecies from next-generation sequencing data as obtained from bulk seque...
متن کاملParallelizing Clique and Quasi-Clique Detection over Graph Data
In a wide variety of emerging data-intensive applications, such as social network analysis, Web document clustering, entity resolution, and detection of consistently co-expressed genes in systems biology, the detection of dense subgraphs (cliques and approximate or quasi-cliques) is an essential component. Unfortunately, these problems are NP-Complete and thus computationally intensive at scale...
متن کاملA scalable, parallel algorithm for maximal clique enumeration
The problem of maximal clique enumeration (MCE) is to enumerate all of the maximal cliques in a graph. Once enumerated, maximal cliques are widely used to solve problems in areas such as 3-D protein structure alignment, genome mapping, gene expression analysis, and detection of social hierarchies. Even the most efficient serial MCE algorithms require large amounts of time to enumerate the maxim...
متن کاملSemidefinite programming relaxations for graph coloring and maximal clique problems
The semidefinite programming formulation of the Lovász theta number does not only give one of the best polynomial simultaneous bounds on the chromatic number χ(G) or the clique number ω(G) of a graph, but also leads to heuristics for graph coloring and extracting large cliques. This semidefinite programming formulation can be tightened toward either χ(G) or ω(G) by adding several types of cutti...
متن کاملEfficient clique decomposition of a graph into its atom graph
We explain how to organize the atoms resulting from clique minimal separator decomposition into a metagraph which we call the atom graph, and give an efficient recursive algorithm to compute this graph at no extra cost than computing the atoms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Science and Engineering
سال: 2016
ISSN: 2364-1185,2364-1541
DOI: 10.1007/s41019-017-0033-5